Managing parallel inquiries in agents' two-sided search

Managing parallel inquiries in agents' two-sided search

In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided search mechanisms are based on a purely sequential search of all searchers, our mechanism integrates an ability of some of the agents to maintain several search efforts in parallel at each search stage. We show that i...

Two-sided Search Games

NUMBER 4 A target hides himself in one of the boxes 1,2, ... , m with probability distribution X=<Xl, ... , Xm) and can move to any of other boxes after each unsuccessful search by a searcher. The searcher is not informed of x and continues search until the target is found. He is informed of Ci'S, i.e., examination costs of each box, and ai's, i= 1, ... , m, where ai is the probability of overl...

Two-sided Search in International Markets

Two-sided Search in International Markets

Two-sided Search in International Markets